public class TestMyBinaryTree {
    public static void main(String[] args) {
        BinaryTree tree = new BinaryTree();
        BinaryTree.TreeNode root = tree.createTree();
/*        System.out.println("===preOrder()===");
        tree.preOrder(root);
        System.out.println();
        System.out.println("===inOrder()===");
        tree.inOrder(root);
        System.out.println();
        System.out.println("===postOrder()===");
        tree.postOrder(root);
        System.out.println();
        System.out.println("===size1()===");
        int ret = tree.size1(root);
        System.out.println(ret);
        System.out.println("===size2()===");
        int ret2 = tree.size2(root);
        System.out.println(ret2);
        System.out.println("===getLeafCount1()===");
        int leafRet1 = tree.getLeafCount1(root);
        System.out.println(leafRet1);
        System.out.println("===getLeafCount2()===");
        int leafRet2 = tree.getLeafCount2(root);
        System.out.println(leafRet2);*/
/*        int ret = tree.getKLevelCount(root,3);
        System.out.println(ret);
        System.out.println(tree.getHeight(root));
        BinaryTree.TreeNode ret = tree.find(root,'F');
        System.out.println(ret.val);
        tree.invertTree(root);
        tree.preOrder(root);*/
/*        tree.inOrder(root);
        System.out.println();
        tree.inOrderNot(root);*/
/*        tree.preOrder(root);
        System.out.println();
        tree.preOrderNode(root);*/
/*        tree.postOrder(root);
        System.out.println();
        tree.postOrderNot(root);*/
        BinaryTree.Solution sl = new BinaryTree.Solution();
        int[] preorder = {3,9,20,15,7};
        int[] inorder = {9,3,15,20,7};
        BinaryTree.TreeNode node = sl.buildTree(preorder,inorder);

    }
}
